Combinatorial Pattern Matching

May 16 th 2012 Combinatorial Pattern Matching

1) Title: Algorithms for genome assembly Authors: Leena Salmela, Veli Mäkinen, Niko Välimäki, Johannes Ylinen, Esko Ukkonen Presenter: Leena Salmela Description: Current DNA sequencing technologies can produce huge amounts of short reads. The de novo genome assembly problem is to infer the genome of an organism based on these reads. We have studied several problems related to the assembly probl...

Matching Theorems for Combinatorial

Pattern Matching

An important subtask of the pattern discovery process is pattern matching, where the pattern sought is already known and we want to determine how often and where it occurs in a sequence. In this paper we review the most practical techniques to find patterns of different kinds. We show how regular expressions can be searched for with general techniques, and how simpler patterns can be dealt with...

Logical Combinatorial Pattern Recognition

IRIS Lab. Electrical and Computer Engineering Department, The University of Tennessee, Knoxville, USA. [email protected] Laboratory of Pattern Recognition, Institute of Cybernetics, Mathematics and Physics, Havana, Cuba. [email protected] Abstract. In this paper we summarize the main results obtained by the Logical Combinatorial Pattern Recognition (LCPR) Group. The characterist...

Matching Theorems for Combinatorial Geometries